Partitioning-based ontology matching approaches: a comparative analysis

نویسندگان

  • Alsayed Algergawy
  • Friederike Klan
  • Birgitta König-Ries
چکیده

Generic Framework. Ontology matching is the process that takes two or more ontologies to identify semantically corresponding entities across them. As the numbers of developed ontologies as well as the number of entities in each ontology are increasing, traditional approaches to ontology matching fail or are not able to scale. Therefore, there is a growing need for new matching algorithms. A common approach to deal with the large-scale matching problem is the partitioning-based technique [5]. To make these techniques comparable, we propose a generic framework containing the following phases (shown in Fig. 1):

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems

Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

متن کامل

A Comparative Analysis of Ontology and Schema Matching Systems

In a distributed and open system, such as the semantic web and many other applications like information integration, peerpeer communication, etc., the heterogeneity among the data increases enormously. To solve the heterogeneity issue various matching techniques are proposed and large-scale matching needs especially to be supported for different kinds of ontologies and XML schemas due to their ...

متن کامل

Inexact Matching of Ontology Graphs Using Expectation-Maximization

We present a new method for mapping ontology schemas that address similar domains. The problem of ontology matching is crucial since we are witnessing a decentralized development and publication of ontological data. We formulate the problem of inferring a match between two ontologies as a maximum likelihood problem, and solve it using the technique of expectation-maximization (EM). Specifically...

متن کامل

Scalable Matching of Ontology Graphs Using Partitioning

The problem of ontology matching is crucial due to decentralized development and publication of ontological data. An approach proposed towards matching the ontologies is by inferring a match between two ontologies as a maximum likelihood problem, and solves it using the technique of expectation maximization (EM). The structural and lexical similarities between the graphs are identified in this ...

متن کامل

Block Matching for Ontologies

Ontology matching is a crucial task to enable interoperation between Web applications using different but related ontologies. Today, most of the ontology matching techniques are targeted to find 1:1 mappings. However, block mappings are in fact more pervasive. In this paper, we discuss the block matching problem and suggest that both the mapping quality and the partitioning quality should be co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014